Search results for " Information"
showing 10 items of 10075 documents
Latvia. Human Development Report 2010/2011: National identity, Mobility and Capability
2011
The 2010/2011 report was produced under the auspices of the national research programme „National Identity”. The job of the report is to survey the content of individual national belonging in the context of human development. The report particularly focuses on emigration issues, because human development is weakened by a reduction in the size of the country’s population. The fact that people are moving to other countries shows that there is an endless competition among identities, as well as a transformation of those identities. The report also reveals the set of circumstances and techniques (the ability to act) which facilitate links between an individual and a location or region. The firs…
Utopies et medias de masse
2019
International audience; Toute technologie est portée, au moins à ses débuts, par un imaginaire.Utopies et médias de masse traite des courants utopiques qui ont cherché à considérer les médias de masse comme un levier pour une société meilleure. La perspective adoptée est à la fois historique, sociétale et éducationnelle. Elle permet d’expliquer ces courants, de les situer dans leur contexte mais aussi de saisir l’influence qu’ils ont pu avoir. Si cet ouvrage jette parfois un regard rétrospectif sur le XIXe siècle ou plus loin dans le passé, il couvre principalement le XIXe siècle. Il examine également les conditions d’une éducation aux médias de masse au XXIe siècle.L’ouvrage s’adresse aux …
Affective matching of odors and facial expressions in infants: shifting patterns between 3 and 7 months.
2016
Recognition of emotional facial expressions is a crucial skill for adaptive behavior. Past research suggests that at 5 to 7 months of age, infants look longer to an unfamiliar dynamic angry/happy face which emotionally matches a vocal expression. This suggests that they can match stimulations of distinct modalities on their emotional content. In the present study, olfaction-vision matching abilities were assessed across different age groups (3, 5 and 7 months) using dynamic expressive faces (happy vs. disgusted) and distinct hedonic odor contexts (pleasant, unpleasant and control) in a visual-preference paradigm. At all ages the infants were biased toward the disgust faces. This visual bias…
Dynamical learning of a photonics quantum-state engineering process
2021
Abstract. Experimental engineering of high-dimensional quantum states is a crucial task for several quantum information protocols. However, a high degree of precision in the characterization of the noisy experimental apparatus is required to apply existing quantum-state engineering protocols. This is often lacking in practical scenarios, affecting the quality of the engineered states. We implement, experimentally, an automated adaptive optimization protocol to engineer photonic orbital angular momentum (OAM) states. The protocol, given a target output state, performs an online estimation of the quality of the currently produced states, relying on output measurement statistics, and determine…
Common fixed points of g-quasicontractions and related mappings in 0-complete partial metric spaces
2012
Abstract Common fixed point results are obtained in 0-complete partial metric spaces under various contractive conditions, including g-quasicontractions and mappings with a contractive iterate. In this way, several results obtained recently are generalized. Examples are provided when these results can be applied and neither corresponding metric results nor the results with the standard completeness assumption of the underlying partial metric space can. MSC:47H10, 54H25.
Variable time amplitude amplification and quantum algorithms for linear algebra problems
2012
Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …
Efficient generation of restricted growth words
2013
A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.
Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial
2018
Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...
Adjacency matrices of random digraphs: singularity and anti-concentration
2017
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…